Polyhedral Aspects of Self-Avoiding Walks
نویسندگان
چکیده
In this paper, we study self-avoiding walks of a given length on a graph. We consider a formulation of this problem as a binary linear program. We analyze the polyhedral structure of the underlying polytope and describe valid inequalities. Proofs for their facial properties for certain special cases are given. In a variation of this problem one is interested in optimal configurations, where an energy function measures the benefit if certain path elements are placed on adjacent vertices of the graph. The most prominent application of this problem is the protein folding problem in biochemistry. On a set of selected instances, we demonstrate the computational merits of our approach.
منابع مشابه
Polygons and the Lace Expansion
We give an introduction to the lace expansion for self-avoiding walks, with emphasis on self-avoiding polygons, and with a focus on combinatorial rather than analytical aspects. We derive the lace expansion for self-avoiding walks, and show that this is equivalent to taking the reciprocal of the self-avoiding walk generating function. We list some of the rigorous results for self-avoiding walks...
متن کاملSelf-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
We study self-avoiding and neighbour-avoiding walks and lattice trails on two semiregular lattices, the (3.122) lattice and the (4.82) lattice. For the (3.122) lattice we find the exact connective constant for both self-avoiding walks, neighbour-avoiding walks and trails. For the (4.82) lattice we generate long series which permit the accurate estimation of the connective constant for self-avoi...
متن کاملSelf-avoiding walks on fractal spaces : exact results and Flory approximation
2014 Self-avoiding walks (SAW) explore the backbone of a fractal lattice, while random walks explore the full lattice. We show the existence of an intrinsic exponent for SAW and examine a simple Flory approximation that uses the spectral dimension of the backbone. Exact results for various fractal lattices show that this approximation is not very satisfactory and that properties of SAW depend o...
متن کاملPrudent Self-Avoiding Walks
We have produced extended series for prudent self-avoiding walks on the square lattice. These are subsets of self-avoiding walks. We conjecture the exact growth constant and critical exponent for the walks, and show that the (anisotropic) generating function is almost certainly not differentiably-finite.
متن کاملBallistic behavior for biased self-avoiding walks
For self-avoiding walks on the d-dimensional cubic lattice defined with a positive bias in one of the coordinate directions, it is proved that the drift in the favored direction is strictly positive. c © 2008 Elsevier B.V. All rights reserved. Keyword: Biased self-avoiding walks
متن کامل